Designing a Tunable Nested Data-Parallel Programming System
نویسندگان
چکیده
منابع مشابه
Evolution of a Nested-Parallel Programming System
Pure nested-parallelism programming models are appealing due to their ease of programming and good analysis and debugging properties. Although their simple synchronization structure is appropriate to represent abstract parallel algorithms, it does not take into account many implementation issues. In this work we present key features of the evolution of a programming system based on high-level, ...
متن کاملExpressing Nested Data Parallel
Data parallelism has proven itself as a useful language technique for eeciently specifying a parallel computation. However, almost all research to date has concentrated on paradigms to support data parallelism over regular data structures. While many target applications map readily onto these models, many do not. In this paper we advocate a more general form of data parallelism which allows par...
متن کاملDesigning Parallel Operating Systems via Parallel Programming
Ever-increasing demand for computing capability is driving the construction of ever-larger computer clusters, soon to be reaching tens of thousands of processors. Many functionalities of system software have failed to scale accordingly–systems are becoming more complex, less reliable, and less efficient. Our premise is that these deficiencies arise from a lack of global control and coordination...
متن کاملSPC-XML: A Structured Representation for Nested-Parallel Programming Languages
Nested-parallelism programming models, where the task graph associated to a computation is series-parallel, present good analysis properties that can be exploited for scheduling, cost estimation or automatic mapping to different architectures. In this paper we present an XML intermediate representation for nestedparallel programming languages from which the application task-graph can be easily ...
متن کاملImplementation of a Data-parallel Concurrent Constraint Programming System
In 12], we proposed Firebird, a new concurrent constraint programming language 9] which supports both concurrency and data-parallelism. Committed-choice indeterminism and don't know nondeterminism are integrated, but in a manner diierent from the Andorra Model 16]. Instead of nondeterminate clauses, nite domain variables form the basis of don't know nondeterminism in Firebird. After a domain va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2016
ISSN: 1544-3566,1544-3973
DOI: 10.1145/3012011